Andrei Rodin, Constructive Axiomatic Method and Modern Physics In 1900 David Hilbert announced his famous list of then-opened mathematical problems; the problem number 6 in this list is the axioma

Source URL: philomatica.org

Estimating Learning Rates in Evolution and TDL: Results on a Simple Grid-World Problem Simon M. Lucas Abstract— When learning to play a game or perform some task, it is important to learn as quickly and effectively as

Source URL: game.itu.dk

• Applied mathematics
• Cybernetics
• Machine learning
• Cognitive science
• Evolution
• Genetic algorithms
• Mathematical optimization
• Q-learning
• Reinforcement learning
• Artificial neural network
• Evolutionary computation
• Evolutionary algorithm

Banach spaces with the “scalar-plus-compact” and “invariant subspace” properties. Spiros Argyros (NTUA) We will discuss two structural properties of the space of boundedlinear operators L(X) of a Banach space X.

Source URL: www.7ecm.de

• Mathematical analysis
• Mathematics
• Operator theory
• Functional analysis
• Invariant subspace problem
• Invariant subspace
• Reflexive space
• Banach space
• Per Enflo
• Compact operator
• Tsirelson space
• Approximation property

On the Modular Inversion Hidden Number Problem San Ling Div. of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, 637371

Source URL: users.monash.edu.au

Leading Gaming Company Chooses Countly for its Recently Published Game on Steam INDUSTRY PC games PROBLEM Company is looking for a decent mobile analytics

Source URL: count.ly

• Business intelligence
• Analytics
• Big data
• Mathematical finance
• Data
• Information technology
• Computing

Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc

Source URL: www.ijimai.org

• Operations research
• Computational complexity theory
• Scheduling
• Mathematics
• Applied mathematics
• NP-hard problems
• Complexity classes
• Mathematical optimization
• Flow shop scheduling
• Makespan
• Combinatorial optimization
• Schedule

First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Source URL: www.preining.info

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Non-classical logic
• Logic in computer science
• Predicate logic
• First-order logic
• Boolean satisfiability problem
• Gdel numbering
• Many-valued logic
• Kripke semantics

MCS 548 – Mathematical Theory of Artificial Intelligence Fall 2014 Problem Set 3 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and list your collaborator

Source URL: homepages.math.uic.edu

Deterministic MDPs with Adversarial Rewards and Bandit Feedback Raman Arora TTIC 6045 S. Kenwood Ave. Chicago, IL 60637, USA

Source URL: dept.stat.lsa.umich.edu

• Markov models
• Markov processes
• Stochastic optimization
• Mathematical optimization
• Operations research
• Reinforcement learning
• Markov decision process
• Algorithm
• Multi-armed bandit
• Dynamic programming
• Shortest path problem
• PP

Fifth Competition of Pseudo-Boolean Solvers (PB’10) Call for Solvers and Benchmarks http://www.cril.univ-artois.fr/PB10/ G OAL Like the previous competitions (PB05, PB06, PB07 and PB09), the goal is to assess the state

Source URL: www.cril.univ-artois.fr

• Logic in computer science
• Combinatorial optimization
• Operations research
• Numerical software
• Maximum satisfiability problem
• Constraint satisfaction
• Mathematical optimization
• Solver
• Satisfiability
• Integer programming
• Constraint
• Boolean satisfiability problem